Vub Without Recourse to Structure Functions
نویسندگان
چکیده
We present a closed form expression for |Vub|/|VtbV ∗ ts| in terms of the endpoint photon and lepton spectra from the inclusive decays B → Xs γ and B → Xu l ν, respectively, which includes the resummation of the endpoint logs at next to leading order and is completely independent of the B meson structure function. The use of this expression for extracting Vub would eliminate the large systematic errors usually incurred due to the modeling of the heavy quarks’ Fermi motion.
منابع مشابه
Extracting |Vub | Using the Radiative Decay Data
In this talk I review recent progress made in extracting | Vub |, within a systematic expansion, from the cut electron energy and hadronic mass spectra of inclusive B meson decays utilizing the data from radiative decays. It is shown that an extraction is possible without modeling the B meson structure function. I discuss the issues involving the assumptions of local duality in various extracti...
متن کاملConvex simple integer recourse models
We consider the objective function of a simple recourse problem with fixed technology matrix and integer second-stage variables. Separability due to the simple recourse structure allows to study a one-dimensional version instead. Based on an explicit formula for the objective function, we derive a complete description of the class of probability density functions such that the objective functio...
متن کاملA tighter variant of Jensen's lower bound for stochastic programs and separable approximations to recourse functions
In this paper, we propose a new method to compute lower bounds on the optimal objective value of a stochastic program and show how this method can be used to construct separable approximations to the recourse functions. We show that our method yields tighter lower bounds than Jensen’s lower bound and it requires a reasonable amount of computational effort even for large problems. The fundamenta...
متن کاملA Convergent Cutting-Plane and Partial-Sampling Algorithm for Multistage Stochastic Linear Programs with Recourse
We propose an algorithm for multistage stochastic linear programs with recourse where random quantities in di erent stages are independent. The algorithm successively approximates expected recourse functions by building up valid cutting planes to support these functions from below. In each iteration, for the expected recourse function in each stage, one cutting-plane is generated using the dual...
متن کاملSimple integer recourse models: convexity and convex approximations
We consider the objective function of a simple recourse problem with fixed technology matrix and integer second-stage variables. Separability due to the simple recourse structure allows to study a one-dimensional version instead. Based on an explicit formula for the objective function, we derive a complete description of the class of probability density functions such that the objective functio...
متن کامل